深度模拟器液压系统仿真研究

介绍了深度模拟器总体结构及工作原理,针对深度模拟器控制系统中PID算法及其相关参数进行了仿真研究。以深度模拟器液压系统为模型,利用AMESim仿真软件工具,对整个液压系统进行了仿真分析并对系统各元器件的参数进行了优化,为深度模拟器的进一步研究提供了理论基础。     

舰艇编队信息融合中模糊C-均值算法改进研究

在分析舰艇编队信息处理融合的基础上,提出舰艇编队信息融合体系结构、模型和实现框架。针对原C-均值算法在处理数据时的不合理性,提出了改进的模拟C-均值算法,提高分类效果,满足信息融合的实时要求和可靠性要求。     

Methods to reduce dimensionality and identify candidate solutions in multi-objective signal timing problems

Adjusting traffic signal timings is a practical way for agencies to manage urban traffic without the need for significant infrastructure investments. Signal timings are generally selected to minimize the total control delay vehicles experience at an intersection, particularly when the intersection is isolated or undersaturated. However, in practice, there are many other potential objectives that might be considered in signal timing design, including: total passenger delay, pedestrian delays, delay inequity among competing movements, total number of stopping maneuvers, among others. These objectives do not tend to share the same relationships with signal timing plans and some of these objectives may be in direct conflict. The research proposes the use of a new multi-objective optimization (MOO) visualization technique—the mosaic plot—to easily quantify and identify significant tradeoffs between competing objectives using the set of Pareto optimal solutions that are normally provided by MOO algorithms. Using this tool, methods are also proposed to identify and remove potentially redundant or unnecessary objectives that do not have any significant tradeoffs with others in an effort to reduce problem dimensionality. Since MOO procedures will still be needed if more than one objective remains and MOO algorithms generally provide a set of candidate solutions instead of a single final solution, two methods are proposed to rank the set of Pareto optimal solutions based on how well they balance between the competing objectives to provide a final recommendation. These methods rely on converting the objectives to dimensionless values based on the optimal value for each specific objectives, which allows for direct comparison between and weighting of each. The proposed methods are demonstrated using a simple numerical example of an undersaturated intersection where all objectives can be analytically obtained. However, they can be readily applied to other signal timing problems where objectives can be obtained using simulation outputs to help identify the signal timing plan that provides the most reasonable tradeoff between competing objectives.     

城市轨道交通常态与非常态短期客流预测方法研究

城市轨道交通客流特征除表现为常态的周期性、季节性及高峰性外,还会因节假日、体育赛事、城市大型活动、突发事件、特殊天气等因素表现出差异性和特殊性,本文对较为成熟的常态及研究较少的非常态客流预测方法进行了实验.首先利用通用的ARIMA时间序列预测算法分析样本历史数据实现常态日客流预测;其次针对客流特殊因素提出时间序列及回归分析的组合模型,同时引进虚拟变量和结合相似日样本数据进一步改进,实现非常态预测问题的高精度求解.仿真计算结果表明,本文方法对解决短期客流预测具有良好的适用度,尤其同样本同预测周期条件下的非常态组合改进模型和常用单一时间序列模型的对比,证明改进模型可以很好地应用在客流特征既包括随时间固有不变的性质又表现出特殊因素的研究中,具有较强的自适应性和更好的预测精度.     

考虑动态定价的煤炭调运方案优化研究

煤炭坑口价格的变化与市场供求有重要联系.本文在煤炭坑口价格动态定价的基础上,以煤炭产地和消费地间的煤炭调运量为决策变量,以煤炭流通过程中的总费用最小化为目标,分别构建了煤炭调运系统优化模型和考虑消费者竞争的煤炭调运优化模型,设计了遗传算法和Floyd算法相结合的求解算法.以我国内地煤炭调运问题为案例,分析了价格变化特性、可调出量与消费量比例等因素对煤炭调运方案的影响.结果表明,考虑消费者竞争时煤炭流通广义费用更低;随着煤炭可调出量与消费量比的增加,动态价格较固定价格的煤炭流通广义费用下降更快.     

An optimal data-splitting algorithm for aircraft scheduling on a single runway to maximize throughput

In this research, we present a data-splitting algorithm to optimally solve the aircraft sequencing problem (ASP) on a single runway under both segregated and mixed-mode of operation. This problem is formulated as a 0–1 mixed-integer program (MIP), taking into account several realistic constraints, including safety separation standards, wide time-windows, and constrained position shifting, with the objective of maximizing the total throughput. Varied scenarios of large scale realistic instances of this problem, which is NP-hard in general, are computationally difficult to solve with the direct use of commercial solver as well as existing state-of-the-art dynamic programming method. The design of the algorithm is based on a recently introduced data-splitting algorithm which uses the divide-and-conquer paradigm, wherein the given set of flights is divided into several disjoint subsets, each of which is optimized using 0–1 MIP while ensuring the optimality of the entire set. Computational results show that the difficult instances can be solved in real-time and the solution is efficient in comparison to the commercial solver and dynamic programming, using both sequential, as well as parallel, implementation of this pleasingly parallel algorithm.     

Foldable container in empty container repositioning in intermodal transportation network of Belt and Road Initiative: strengths and limitations

In 2013, the concept of the ‘Silk Road Economic Belt and the 21st-Century Maritime Silk Road (Belt and Road)’ was initiated by the Chinese government, which involves Asian, European and African continents and their adjacent seas. Logistics plays a core role in such a large framework of economy and trade. In recent years, China, European Union, and Southeast Asia pay much attention to the design and development of the intermodal transportation network towards both economic and environmental efficiency. In this paper, we propose an empty container repositioning model in the intermodal transportation network of Belt and Road (B&R) Initiative by considering both standard and foldable containers. In this model, empty containers are repositioned from the inland of the original area, such as China, to other areas of B&R Initiative related countries and regions, such as European Union and Southeast Asia. We develop a mixed integer linear programming model to determine the optimal repositioning of empty containers via the intermodal transportation network. An Artificial Bee Colony algorithm is developed to solve large size problems in practice and numerical experiments are conducted to show the efficiency of our proposed algorithm. We provide managerial insights regarding the impact on the network performance of foldable containers transportation.     

Direct formulation and algorithms for the probit-based stochastic user equilibrium traffic assignment problem

This paper proposes simple and direct formulation and algorithms for the probit-based stochastic user equilibrium traffic assignment problem. It is only necessary to account for random variables independent of link flows by performing a simple transformation of the perceived link travel time with a normal distribution. At every iteration of a Monte-Carlo simulation procedure, the values of the random variables are sampled based on their probability distributions, and then a regular deterministic user equilibrium assignment is carried out to produce link flows. The link flows produced at each iteration of the Monte-Carlo simulation are averaged to yield the final flow pattern. Two test networks demonstrate that the proposed algorithms and the traditional algorithm (the Method of Successive Averages) produce similar results and that the proposed algorithms can be extended to the computation of the case in which the random error term depends on measured travel time.     

基于AIGA-WLSSVM的埋地管道腐蚀速率预测方法

为了降低埋地管道腐蚀影响因素之间的复杂相关性,提高腐蚀预测精度,文中提出一种基于自适应免疫遗传算法-加权最小二乘支持向量机(AIGA-WLSSVM)的埋地管道腐蚀速率预测建模方法,并采用AIGA优化模型参数,进一步提高模型的学习能力和稳定性。最后通过实例分析验证了AIGA-WLSSVM建模方法在埋地管道腐蚀速率预测中的可行性和有效性,为埋地管道的检修与更换提供参考。     

Mental models of driving and speed: biases,choices and reality

This paper provides a review of research performed by Svenson with colleagues and others work on mental models and their practical implications. Mental models describe how people perceive and think about the world including covariances and relationships between different variables, such as driving speed and time. Research on mental models has detected the time-saving bias [Svenson, O. (1970). A functional measurement approach to intuitive estimation as exemplified by estimated time savings. Journal of Experimental Psychology, 86, 204–210]. It means that drivers relatively overestimate the time that can be saved by increasing speed from an already high speed, for example, 90–130?km/h, and underestimate the time that can be saved by increasing speed from a low speed, for example, 30–45?km/h. In congruence with this finding, mean speed judgments and perceptions of mean speeds are also biased and higher speeds given too much weight and low speeds too little weight in comparison with objective reality. Replacing or adding a new speedometer in the car showing min per km eliminated or weakened the time-saving bias. Information about braking distances at different speeds did not improve overoptimistic judgments of braking capacity, but information about collision speed with an object suddenly appearing on the road did improve judgments of braking capacity. This is relevant to drivers, politicians and traffic regulators.